Mixing Time of a Rook’s Walk
نویسندگان
چکیده
منابع مشابه
Covering a chessboard with staircase walks
An ascending (resp., descending) staircase walk on a chessboard is a rook’s path that goes either right or up (resp., down) in each step. We show that the minimum number of staircase walks that together visit every square of an n× n chessboard is d 3ne .
متن کاملMixing Times in Quantum Walks on Two-Dimensional Grids
Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving the eigenproblem for the evolution opera...
متن کاملMixing Times for Random Walks on Geometric Random Graphs
A geometric random graph, G(n, r), is formed as follows: place n nodes uniformly at random onto the surface of the d-dimensional unit torus and connect nodes which are within a distance r of each other. The G(n, r) has been of great interest due to its success as a model for ad-hoc wireless networks. It is well known that the connectivity of G(n, r) exhibits a threshold property: there exists a...
متن کاملLocal Mixing Time: Distributed Computation and Applications
The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient algorithms. We introduce a new notion of mixing of a random walk on a (undirected) graph, called local mixing. Informally, the local mixing with respect to a given node s, is the mixing of a rando...
متن کاملMixing of quantum walk on circulant bunkbeds
We give new observations on the mixing dynamics of a continuous-time quantum walk on circulants and their bunkbed extensions. These bunkbeds are defined through two standard graph operators: the join G + H and the Cartesian product G ⊕ H of graphs G and H . Our results include the following: • The quantum walk is average uniform mixing on circulants with bounded eigenvalue multiplicity. This ex...
متن کامل